Energy efficient downlink scheduling in LTE-advanced networks

ABSTRACT

A method is provided for performing downlink scheduling in Long Term Evolution-Advanced networks. The method includes assigning resource blocks and transmission modes to users such that (i) each of the users that is assigned at least one of the resource blocks is assigned only one transmission mode chosen from a finite set of transmission modes, (ii) a sum of normalized costs across all of the resource blocks that are assigned to the users is less than unity. The method further includes incorporating a resource block and transmission mode assignment for a user into downlink scheduler of a base station to cause the downlink scheduler to perform downlink scheduling in accordance with the resource block and transmission mode assignment.

RELATED APPLICATION INFORMATION

This application claims priority to application No. 62/214,343 filed on Sep. 4, 2015, incorporated herein by reference in its entirety.

BACKGROUND

Technical Field

The present invention relates to energy efficiency and, more particularly, to energy efficient downlink scheduling in LTE-Advanced networks.

Description of the Related Art

Energy efficiency is becoming an increasingly popular paradigm in wireless networks. The main motivation behind energy efficient resource allocation is to reliably transmit as many bits as possible for every joule of energy spent, thereby ensuring that the explosive growth in wireless services is managed with as low a carbon footprint as possible. Additionally, increased energy efficiency would decrease the overall operating cost for the operators of wireless networks.

Furthermore, each base station in a wireless network does not consume the same quantity of energy and, for each base station, the amount of energy consumed may continuously change. This is particularly true for Long-Term Evolution (LTE) wireless networks. For instance, if the number of users accessing a particular base station or their aggregate traffic demand in a wireless network decreases, the base station need not transmit in the downlink as many bits as it would if the number of users connected to the base station were greater or their aggregate traffic demand were greater. Therefore, to conserve energy, a method for efficient downlink scheduling is needed.

SUMMARY

According to an aspect of the present invention, a method is provided for performing downlink scheduling in Long Term Evolution-Advanced networks. The method includes assigning resource blocks and transmission modes to users such that (i) each of the users that is assigned at least one of the resource blocks is assigned only one transmission mode chosen from a finite set of transmission modes, (ii) a sum of normalized costs across all of the resource blocks that are assigned to the users is less than unity. The method further includes incorporating a resource block and transmission mode assignment for a user into downlink scheduler of a base station to cause the downlink scheduler to perform downlink scheduling in accordance with the resource block and transmission mode assignment.

According to another aspect of the present principles, a computer program product is provided for performing downlink scheduling in Long Term Evolution-Advanced networks. The computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a computer to cause the computer to perform a method. The method includes assigning resource blocks and transmission modes to users such that (i) each of the users that is assigned at least one of the resource blocks is assigned only one transmission mode chosen from a finite set of transmission modes, (ii) a sum of normalized costs across all of the resource blocks that are assigned to the users is less than unity. The method further includes incorporating a resource block and transmission mode assignment for a user into downlink scheduler of a base station to cause the downlink scheduler to perform downlink scheduling in accordance with the resource block and transmission mode assignment.

These and other features and advantages will become apparent from the following detailed description of illustrative embodiments thereof, which is to be read in connection with the accompanying drawings.

BRIEF DESCRIPTION OF DRAWINGS

The disclosure will provide details in the following description of preferred embodiments with reference to the following figures wherein:

FIG. 1 is a block diagram illustrating an exemplary processing system to which the present principles may be applied, in accordance with an embodiment of the present principles;

FIG. 2 is a flowchart illustrating a method for performing downlink scheduling in Long Term Evolution-Advanced (LTE-A) networks, in accordance with an embodiment of the present principles;

FIGS. 3-4 are flowcharts illustrating a method for performing downlink scheduling in LTE-A networks, in accordance with an embodiment of the present principles;

FIG. 5 is a block diagram illustrating an exemplary system for downlink scheduling in LTE-A networks, in accordance with an embodiment of the present principles; and

FIG. 6 is a block diagram illustrating an exemplary system for downlink scheduling in LTE-A networks, in accordance with an embodiment of the present principles.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

In accordance with the present principles, systems and methods are provided for maximizing energy efficiency in downlink scheduling in Long-Term Evolution-Advanced (LTE-A) systems.

For Long Term Evolution (LTE)-Advanced (LTE-A) systems, a downlink scheduling problem is considered in which the objective is maximizing the weighted sum of throughputs through a base station in a wireless network. In analyzing this problem, several constraints are imposed. The constraints are listed below, with the motivation for each. In particular, these constraints are:

-   C1. The number of users scheduled in a subframe cannot exceed a     certain threshold. This constraint helps in reducing the control     channel signaling overhead. -   C2. The transmission mode on all the resource blocks (RBs) allocated     to the same user needs to be the identical. Each transmission mode     must be selected from a given finite set. It can represent, for     instance, the spatial rank assigned to the user (LTE Release 10 and     beyond), or the choice between spatial multiplexing and transmit     diversity (LTE Release 8 and beyond), or it can indicate a transmit     precoder drawn from a finite codebook (LTE Release 8). Thus, by     imposing the one transmission mode per scheduled user constraint, we     can account for mandatory constraints imposed by several LTE     releases. -   C3. The bit loading on any RB must conform to the permissible     choices. This constraint facilitates in modeling the finite     modulation and coding scheme (MCS) constraints. In addition, the     bits assigned to each scheduled user must not exceed its queue     (buffer) size. -   C4. The sum cost of all the RBs that are utilized should not exceed     a bound. Incorporating this constraint is very useful for energy     efficiency as previously discussed.

In one embodiment, the system determines a set of 3-tuples, each containing a user, a transmission mode, and a bit-loading vector, to schedule downlink transmission in a base station in a wireless network.

Referring now to the drawings in which like numerals represent the same or similar elements and initially to FIG. 1, an exemplary processing system 100, to which the present principles may be applied, is illustratively depicted in accordance with an embodiment of the present principles. The processing system 100 includes at least one processor (CPU) 104 operatively coupled to other components via a system bus 102. A cache 106, a Read Only Memory (ROM) 108, a Random Access Memory (RAM) 110, an input/output (I/O) adapter 120, a sound adapter 130, a network adapter 140, a user interface adapter 150, and a display adapter 160, are operatively coupled to the system bus 102.

A first storage device 122 and a second storage device 124 are operatively coupled to system bus 102 by the I/O adapter 120. The storage devices 122 and 124 can be any of a disk storage device (e.g., a magnetic or optical disk storage device), a solid state magnetic device, and so forth. The storage devices 122 and 124 can be the same type of storage device or different types of storage devices.

A speaker 132 is operatively coupled to system bus 102 by the sound adapter 130. A transceiver 142 is operatively coupled to system bus 102 by network adapter 140. A display device 162 is operatively coupled to system bus 102 by display adapter 160.

A first user input device 152, a second user input device 154, and a third user input device 156 are operatively coupled to system bus 102 by user interface adapter 150. The user input devices 152, 154, and 156 can be any of a keyboard, a mouse, a keypad, an image capture device, a motion sensing device, a microphone, a device incorporating the functionality of at least two of the preceding devices, and so forth. Of course, other types of input devices can also be used, while maintaining the spirit of the present principles. The user input devices 152, 154, and 156 can be the same type of user input device or different types of user input devices. The user input devices 152, 154, and 156 are used to input and output information to and from system 100.

Of course, the processing system 100 may also include other elements (not shown), as readily contemplated by one of skill in the art, as well as omit certain elements. For example, various other input devices and/or output devices can be included in processing system 100, depending upon the particular implementation of the same, as readily understood by one of ordinary skill in the art. For example, various types of wireless and/or wired input and/or output devices can be used. Moreover, additional processors, controllers, memories, and so forth, in various configurations can also be utilized as readily appreciated by one of ordinary skill in the art. These and other variations of the processing system 100 are readily contemplated by one of ordinary skill in the art given the teachings of the present principles provided herein.

Moreover, it is to be appreciated that systems 500 and 600, described with respect to FIGS. 5 and 6, respectively, are systems for implementing respective embodiments of the present principles. Part or all of processing system 100 may be implemented in one or more of the elements of systems 500 and 600, according to various embodiments of the present principles.

Further, it is to be appreciated that processing system 100 may perform at least part of the method described herein including, for example, at least part of method 200 of FIG. 2 and method 300 of FIGS. 3-4. Similarly, part or all of systems 500 and 600 of FIGS. 5-6 may be used to perform at least part of method 200 of FIG. 2 and method 300 of FIGS. 3-4 according to various embodiments of the present principles.

Referring now to FIG. 2 an exemplary method 200 is shown, in accordance with an embodiment of the present principles.

At block S210, input the following: user set; set of modes; queue sizes; per-RB normalized costs, a scalar k; a module to compute weighted expected throughput on any RB for any user, any mode, and any permissible bit loading. Alternatively, the weighted expected throughputs on all RBs for all users and all permissible bit loadings can be provided as inputs.

At block S215, define a ground set of all feasible 3-tuples (user, mode, permissible bit-loading vector). Also, define a set (different from the ground set) that includes all selected 3-tuples. Initialize the latter set to be the null (empty) set. Set a scalar ω=0.

At block S220, using method 300 (as described with respect to FIG. 3), select and add to the set, the 3-tuple such that the user in that 3-tuple has not been selected before, an incremental cost of the 3-tuple is less than a bound computed as λ/ω and the 3-tuple offers approximately the best net gain in weighted sum rate utility among all such 3-tuples. Update the scalar ω.

At block S225, determine if the termination conditions are satisfied. If so, then proceed to block S230. Otherwise, return to block S220.

At block S230, determine if the set of 3-tuples satisfies the cost constraint. If not, then proceed to block S235. Otherwise, proceed to block S240.

At block S235, apply greedy pruning to the selected set.

At block S240, incorporate the final set of selected 3-tuples into a processor-based downlink scheduler of a base station to cause the downlink scheduler to perform downlink scheduling in accordance with the final set of 3-tuples.

Referring now to FIGS. 3-4, another exemplary method 300 is shown, in accordance with an embodiment of the present principles.

At block S310, input the following: unselected user set; set of modes; queue sizes; per-RB normalized costs; per-RB effective normalized costs; a module to compute weighted expected throughput on any RB for any user, any mode and any permissible bit loading; and a selected set of 3-tuples.

At block S315, consider an unselected user and each mode as follows. Define a vector of selected permissible bit-loadings and initialize it to a vector of all zeros. Define three scalars where the first scalar is used to enforce the queue constraint and the second scalar is used to enforce the constraint that the sum of the effective normalized costs across occupied RBs should be less than unity.

At block S320, considering all RBs, determine the RB and associated permissible bit-loading such that the ratio of the gain and weighted cost is maximized over each RB and each bit-loading permissible under that mode. The weighted cost is the weighted sum of the bit-loading normalized by the queue size and weighted by the first scalar, and the effective cost of that RB weighted by the second scalar. At block S325, select the bit-loading and update the vector of selected bit loadings, and update the two scalars.

At block S330, determine if the maximal ratio is zero or if the sum of the two scalars exceeds the third scalar. If so, then proceed to block S335. Otherwise, return to block S320.

At block S335, store the 3-tuple formed by the considered user, mode and determined bit-loading vector and compute a gain.

At block S340, determine if all modes and unselected users have been considered. If so, then proceed to block S345. Otherwise, return to block S315.

At block S345, output the 3-tuple yielding the largest gain among all stored 3-tuples.

Referring now to FIG. 5, an exemplary system 500 for downlink scheduling in LTE-A networks is illustratively depicted in accordance with an embodiment of the present principles.

System 500 includes a base station 515. The base station 515 is configured to receive and transmit signals, including a downlink transmission 515, and includes a transmitter and a receiver. The base station 515 communicates with user equipment (collectively denoted by the reference numeral 551).

System 500 further includes a processor 520. The processor 520 computes in each subframe a final set of 3-tuples from a set of users and their weights, a set of transmission modes, a list of queues, a list of normalized costs for each resource block in a set of resource blocks, a ground set of 3-tuples, each 3-tuple including a user from the set of users, a transmission mode from a set of transmission modes, and a bit-loading vector.

The processor 520 includes a storage device 530, configured to store the at least a set of users, the set of transmission modes, the list of queues, the list of normalized costs for each resource block in the set of resource blocks, the ground set of 3-tuples, and the final set of 3-tuples.

The processor 520 further includes a downlink scheduler 525 configured to schedule downlink scheduling of a downlink transmission 515 from the base station 515 to the users.

The system 500 further includes a user interface 540 connected to the processor 520 to enable a user receive the downlink transmission determined as per the downlink scheduler 525.

Referring now to FIG. 6, an exemplary system 600 for downlink scheduling in LTE-A networks is illustratively depicted in accordance with an embodiment of the present principles.

While many aspects of system 600 are described in singular form for the sakes of illustration and clarity, the same can be applied to multiples ones of the items mentioned with respect to the description of system 600. For example, while a single downlink scheduler 620 may be mentioned with respect to system 600, more than one downlink scheduler 620 can be used in accordance with the teachings of the present principles, while maintaining the spirit of the present principles. Moreover, it is appreciated that the downlink scheduler 620 is but one aspect involved with system 600 than can be extended to plural form while maintaining the spirit of the present principles.

In an embodiment, the system 600 may include a plurality of components, which may include one or more processors, downlink schedulers 620, uplink schedulers 630, storage devices (e.g., computer readable storage medium) 640, circuits 650, base stations 660, user interfaces 670, and/or displays. The above components may be connected by, for example, a bus 601, and data (e.g., system condition data, temperature, voltage, etc.) may be collected according to various embodiments of the present principles. The bus may be connected to any components via a wired or wireless connection.

In an embodiment, a processor 610 may be employed to determine a final set of 3-tuples, based on information, such as a user set, transmission modes, and bit-loading data, stored on the storage device 640. In an embodiment, a downlink scheduler 620 may be employed to perform downlink scheduling at a base station 660, based on the final set of 3-tuples. In an embodiment, the downlink scheduler 620 is processor-based.

In an embodiment, a user interface 670 may be employed to enable a user to input any or all of the data parameters used by the downlink scheduler 620.

In an embodiment, at least one display 680 may be employed to display any of the information and data input or output from the system 600.

The expected throughput obtained upon scheduling user u with mode m on RB n and loading b_(n) bits, is given by: b _(n)(1−p _(u,n) ^(m)(b _(n)))  (1) where p_(u,n) ^(m)(b_(n)) is the corresponding block error probability. B denotes the set of all possible bit loadings that can be done on any RB. B_(min)==min{b: b∈B} and B_(max)=max{b: b∈B}. The set B can be any arbitrary finite set or it can be an uncountable albeit compact interval, [B_(min), B_(max)]. Then, letting α_(u)>0 denote the given (input) weight assigned to user u, and maximizing over the bit loading, the maximum expected weighted throughput is obtained, as:

$\begin{matrix} {r_{u,n}^{m} = {\alpha_{u}{\max\limits_{b_{n}:{b_{n} \in B}}{\left\{ {b_{n}\left( {1 - {p_{u,n}^{m}\left( b_{n} \right)}} \right)} \right\}.}}}} & (2) \end{matrix}$

The throughput model in problem (1) enables imperfections (or errors) in the channel state information to be accommodated at the processor-based downlink scheduler and is more general than the typical assumption made in many previous works, where any variable number of bits b_(n) (subject to an upper bound) can be allocated on RB n and then all of them are then successfully delivered. Indeed, this latter model, henceforth referred to as the 0-1 throughput model, assumes that each error probability is a step function, i.e., p_(u,n) ^(m)(b_(n))=1{b_(n)>B_(u,n) ^(m)}, where 1{.} denotes the indicator function that is equal to one if the input argument is true and equal to zero otherwise. B_(u,n) ^(m)>0 denotes the maximal number of information bits that can be loaded on RB n when scheduling user u with mode m. In addition, under this model, the set B is assumed to be an interval with B_(max)≥B_(u,n) ^(m), ∀ u, m, n.

x_(u,n) ^(m) is defined as the indicator variable, which is equal to one if user u is scheduled on RB n with transmission mode m, and equal to zero otherwise. Let K, M be the total number of users and transmission modes, respectively. K is defined as the maximum number of users that can be scheduled in a subframe. Also, N={1, . . . , N} denotes the set of available RBs.

Under a backlogged traffic model, using equation (2), the scheduling problem is formulated as:

$\begin{matrix} {{\max\limits_{\{{x_{u,n}^{m} \in {\{{0,1}\}}}\}}\mspace{20mu}{\sum_{u = 1}^{K}{\sum_{n = 1}^{N}{\sum_{m = 1}^{M}{r_{u,n}^{m}x_{u,n}^{m}}}}}}{{{{subject}\mspace{14mu}{to}\mspace{20mu}{\sum_{m = 1}^{M}{\sum_{u = 1}^{K}x_{u,n}^{m}}}} \leq 1},{1 \leq n \leq N}}\mspace{121mu}{{{\sum_{m = 1}^{M}{\max_{n = 1}^{N}x_{u,n}^{m}}} \leq 1},{1 \leq u \leq K}}\mspace{121mu}{{\sum_{u = 1}^{K}{\sum_{m = 1}^{M}{\max_{n = 1}^{N}x_{u,n}^{m}}}} \leq \overset{\_}{K}}\mspace{121mu}{{{\sum_{n = 1}^{N}{\sum_{u = 1}^{K}{\sum_{m = 1}^{M}{a_{n}x_{u,n}^{m}}}}} \leq 1},}} & (3) \end{matrix}$ where the first set of constraints requires that on each RB (e.g., for a carrier subfrequency in a time-frequency grid), at most one user with one transmission mode (e.g., out of the seven transmission modes in 3GPP) can be scheduled, the second set of constraints stipulates that each user can only have one transmission mode (i.e., one common transmission mode is used across all RBs allocated to the user), the third constraint requires that the maximum number of scheduled users cannot exceed K, and the last constraint dictates that the sum cost of all occupied RBs should be no greater than unity. Notice that the non-negative scalars {a_(n)}, n∈N are used to denote the normalized costs associated with using the RBs. Without loss of generality, a_(n) ∈ [0, 1], ∀ n∈N is assumed.

Under a finite queue model, it is assumed that user u has a finite queue size Q_(u). b_(u,n) ^(m) is denoted as the number of information bits allocated on RB n when user u is assigned to that RB with transmission mode m (i.e., when x_(u,n) ^(m)=1). The scheduling problem is then formulated as:

$\begin{matrix} {{\max\limits_{\{{x_{u,n}^{m},b_{u,n}^{m}}\}}\mspace{20mu}{\sum_{u = 1}^{K}{\sum_{n = 1}^{N}{\sum_{m = 1}^{M}{\alpha_{u}x_{u,n}^{m}{b_{u,n}^{m}\left( {1 - {p_{u,n}^{m}\left( b_{u,n}^{m} \right)}} \right)}}}}}}{{{{subject}\mspace{14mu}{to}\mspace{20mu}{\sum_{m = 1}^{M}{\sum_{u = 1}^{K}x_{u,n}^{m}}}} \leq 1},{1 \leq n \leq {N\mspace{121mu}{{\sum_{m = 1}^{M}{\max_{n = 1}^{N}x_{u,n}^{m}}} \leq 1}}},{1 \leq u \leq {K\mspace{121mu}{\sum_{u = 1}^{K}{\sum_{m = 1}^{M}{\max_{n = 1}^{N}x_{u,n}^{m}}}}} \leq {\overset{\_}{K}\mspace{121mu}{\sum_{n = 1}^{N}{\sum_{u = 1}^{K}{\sum_{m = 1}^{M}{a_{n}x_{u,n}^{m}}}}}} \leq 1},\mspace{121mu}{{\sum_{m = 1}^{M}{\sum_{n = 1}^{N}{x_{u,n}^{m}b_{u,n}^{m}}}} \leq Q_{u}},{1 \leq u \leq K}}\mspace{124mu}{{{{{x_{u,n}^{m} \in \left\{ {0,1} \right\}}\&}\mspace{14mu} b_{u,n}^{m}} \in B},{\forall u},m,n,}} & (4) \end{matrix}$ where the penultimate set of constraints model the queue size limit for each user.

To prove the hardness of the problems in problems (3) and (4), it suffices to consider the 0-1 throughput model and instances where the sum cost constraint is irrelevant (i.e., Σ_(n∈N) a_(n)≤1). Then, it can be seen that problem (3) allows for more than 2 transmission modes. On the other hand, it can be seen that problem (4) allows for more than one mode. Invoking the hardness results, the following theorem (Theorem 1) can be deduced:

-   -   Problem (3) is NP-hard. There exists a δ>0, such that it is         NP-hard to obtain (1−δ)-approximation to problem (4).

The simplified version of problem (4) is the classical combinatorial auction problem with submodular valuations, i.e., where the RBs have to be distributed among the users with each user's utility being a submodular function. For this problem, a classical greedy algorithm is well suited. Regarding the original version in problem (4), the following theorem (Theorem 2) can be shown:

-   -   For the 0-1 throughput model, problem (4) is a combinatorial         auction problem with fractionally sub-additive valuations and a         linear cost constraint.

In accordance with the present principles, a unified algorithm is presented to solve the downlink scheduling problems in problems (3) and (4). The unified algorithm achieves a competitive approximation ratio under both of the traffic models.

The unified algorithm constructs a set S of scheduled users, a set R of selected RBs with Σ_(n∈R) a_(n)≤1, a transmission mode and a distinct set of RBs in R allocated to each user u∈S. To achieve this objective, a two-stage approach is adopted wherein the first stage selects a set of users in which each user is assigned one mode and a distinct set of RBs. This selection is feasible with respect to all constraints of problems (3) and (4), except for the cost constraint. Consequently, in the second stage, the output of the first stage is pruned in order to obtain a (fully) feasible solution. According to the present principles, the cost constraint is enforced in a soft manner in the first stage. This enables a solution from the first stage to be obtained that is close to the optimal solution, while not significantly violently violating the cost constraint. Then, pruning the solution so obtained yields a feasible solution for which a competitive approximation guarantee can be derived. The pseudo-code of the two-stage unified algorithm is illustrated in Table 1.

TABLE 1 Unified Scheduling Algorithm  1. U = {1, . . . , K}, S = ∅, V_(n) = 0 for 1 ≤ n ≤ N, λ > 1, w = 1  2. while Termination conditions not satisfied do  3.  for all u ∈ U do  4.   for m = 1 to M do  5.    Compute the value {circumflex over (v)}(u, n, m) on each RB n and the net gain g (u, m), while satisfying Σ_(n=1) ^(N) a_(n)1{{circumflex over (v)}(n, u, m) > $\left. 0 \right\} \leq {\min{\left\{ {\frac{\lambda}{w},1} \right\}.}}$  6.   end for  7.  end for  8.  (u*, m*) = argmax_(u∈U, 1≤M) g(u, m).  9.  If g (u*, m*) = 0, go to 19. 10.  Add user u* to S and remove it from U. 11.  for n = 1, . . . , N do 12.    if {circumflex over (v)}(u*, n, m*) > V_(n) then 13.     Allocate RB n to user u*, 14.     V_(n) = {circumflex over (v)}(u*, n, m*). 15.    end if 16.   end for 17.   Update w = λ^(Σ) ^(n=1) ^(N) ^(a) ^(n) ^(1{V) ^(n) ^(>0}) 18. end while 19. Determine R′ {n: V_(n) > 0} 20. if Σ_(n∈R′) a_(n) > 1 then 21.   Determine a subset R ⊂ R′ such that Σ_(n∈R′) a_(n) > 1 22. else 23.   Set R = R′ 24. end if 25. Re-select the optimal transmission mode for each user within the set R of selected RBs.

The First Stage of the Unified Algorithm 1.

U is denoted as the set of candidate users that have not so far been selected. Initially, U={1, . . . , K} and S=Ø. A current value V_(n) is defined for each RB n∈N, representing the weighted throughput of the current allocation on that RB, and, initially, V_(n)=0 for all n∈N.

In an embodiment, V_(n) is considered to be the weighted throughput barrier that a new selection (of user and mode) should exceed on RB n in order to obtain an assignment. Then, scalar w tracks the accumulated cost of all the occupied RBs, i.e., w=λ^(Σ) ^(n∈N) ^(a) ^(n) ^(1{V) ^(n) ^(>0}) and, accordingly, w is initialized to one. Further, λ is designated as a scalar which can be initialized to any value strictly greater than 1. The role of λ is to enforce the cost constraint in a soft manner and it is noted that the approximation ratio does depend on λ.

The first stage of the unified algorithm is iterative. At each iteration, in order to select a new user (and its mode), the following problem must be solved for each candidate user u∈U and each mode m∈{1, . . . , M}:

$\begin{matrix} {{\max\limits_{\{{v{({u,n,m})}}\}}\;{\sum\limits_{n = 1}^{N}{\max\left\{ {{{v\left( {u,n,m} \right)} - V_{n}},0} \right\}}}}{{{subject}\mspace{14mu}{to}\mspace{14mu}{\sum\limits_{n = 1}^{N}{a_{n}1\left\{ {{v\left( {n,u,m} \right)} > 0} \right\}}}} \leq {\min\left\{ {\frac{\lambda}{w},1} \right\}}}} & (5) \end{matrix}$ where v(u, n, m) denotes the weighted throughput obtained upon assigning user u to RB n with mode m. Let {{circumflex over (v)}(u, n, m)}_(n∈N) denote a good feasible solution to problem (5). Define g(u, m)=Σ_(n=1) ^(N) max {{circumflex over (v)}(u, n, m)−V_(n), 0} to be the net gain of adding user u to S with transmission mode m. The exact computation of {circumflex over (v)}(u, n, m) (and, thus, of g(u, m)) depends on the traffic model.

Let (u*, m*)=argmax_(u∈U,m≤M)g(u, m). Then, user u* is added to the scheduled user list (and removed from U) and assigned transmission mode m*. For each RB n∈N, if {circumflex over (v)}(u*, n, m*)>V_(n), then it is allocated to user u* and removed from its previous allocation, if it was allocated previously to any user. This ensures that each user is selected once (with one mode), and that each RB is always assigned to at most one user. Note that the RB allocation is subject to change as an assigned RB may be re-allocated to another user layer, or that RB itself may be dropped from the set R that is eventually selected. V_(n) is now updated as: V _(n)=max{V _(n) ,{circumflex over (v)}(u*,n,m*)},∀n∈N  (6) followed by w=λ^(Σ) ^(n∈N) ^(a) ^(n) ^(1{V) ^(n) ^(>0}). The first stage of the unified algorithm terminates when any of the following conditions are satisfied:

-   i) U=Ø, -   ii) S=K, or -   iii) g(u*,m*)=0.

The Second Stage of the Unified Algorithm

In the second stage of the unified algorithm, the set of all selected RBs R′={n: V_(n)>0}. The obtained solution is feasible if Σ_(n∈R), a_(n)≤1 and set R=R′. Otherwise, the following standard knapsack problem is solved:

$\begin{matrix} {{\max\limits_{R \subseteq R^{\prime}}\;{\sum\limits_{n \in R}V_{n}}},{{{s.t}\mspace{14mu}{\sum\limits_{n \in R}a_{n}}} \leq 1}} & (7) \end{matrix}$ in a greedy based manner to determine the feasible subset R. Finally, considering each user u which is assigned one or more RBs within the set R, its best mode is reselected without changing the RB allocation. Note that the latter optimization is decoupled across users and is simple since the RB allocations are not altered.

Now considered is sub-problem (5), which needs to be solved at each iteration, for each one of the two following traffic models.

Backlogged Traffic Model

Under the backlogged traffic model, without loss of optimality, it can be deduced that, if the n^(th) RB is selected, then {circumflex over (v)}(u, n, m) must be the maximum weighted expected throughput of allocating user u on RB n with transmission mode m, i.e., {circumflex over (v)}(u,n,m)=z _(n) r _(u,n) ^(m)  (8) where z_(n) ∈{0,1}, ∀ n is an indicator variable that is equal to one if RB n is chosen and is equal to zero otherwise. g (u, n) can hence be calculated by solving the following problem:

$\begin{matrix} {{\max\limits_{\{ z_{n}\}}\mspace{14mu}{\sum\limits_{n = 1}^{N}{\max\left\{ {{{z_{n}r_{u,n}^{m}} - V_{n}},0} \right\}}}}{{{s.t}\mspace{14mu}{\sum\limits_{n = 1}^{N}{a_{n}z_{n}}}} \leq {\min\left\{ {\frac{\lambda}{w},1} \right\}}}} & (9) \end{matrix}$

Finite Queue Model

Given u, m, and the finite queue size Q_(u) for each user u, the weighted throughput {circumflex over (v)}(u, n, m) is a function of the bit loading b_(n) on RB n, i.e., {circumflex over (v)}(u, n, m)=a_(u)b_(n) (1−p_(u,n) ^(m)(b_(n))). As a result, the major issue here is to find an adequate bit allocation subject to the queue size constraint. Towards that end, set B_(u) is defined as B_(u)={b∈B: b≤Q_(u)}. Without loss of generality, it is assumed that set B_(u) is non-empty (otherwise a user u, from the set of candidate users, can simply be removed). Then, the problem of interest can be posed as the following:

$\begin{matrix} {{\max\mspace{11mu}{\sum\limits_{n = 1}^{N}{\max\left\{ {{{z_{n}\alpha_{u}{b_{n}\left( {1 - {p_{u,n}^{m}\left( b_{n} \right)}} \right)}} - V_{n}},0} \right\}}}}{{{{s.t}\mspace{14mu} b_{n}} \in B_{u}},{{\forall n};{z_{n} \in \left\{ {0,1} \right\}}}\;,{{\forall n};}}{{\sum\limits_{n = 1}^{N}{b_{n}z_{n}}} \leq Q_{u}}{{\sum\limits_{n = 1}^{N}{a_{n}z_{n}}} \leq {\min\left\{ {\frac{\lambda}{w},1} \right\}}}} & (10) \end{matrix}$

Now proposed is an approximation algorithm to solve both problems (9) and (10).

First, r_(u,m) ^(−m) is set as

$r_{u,n}^{- m} = {\alpha_{u}{\max\limits_{b_{n} \in B_{u}}\left\{ {b_{n}\left( {1 - {p_{u,n}^{m}\left( b_{n} \right)}} \right)} \right\}}}$ and a subset of candidate RBs is defined as

$R_{cand} = {\left\{ {{{{n \in {{N\text{:}\mspace{14mu} r_{u,n}^{- m}} > V_{n}}}\&}\mspace{14mu} a_{n}} \leq {\min\left\{ {\frac{\lambda}{w},1} \right\}}} \right\}.}$ Clearly, there is no reason to allocate to user u any RBs outside of R_(cand). Subsequently, two conditions are defines.

$\begin{matrix} {{{C\; 1\text{:}\;{\sum_{n \in R_{cand}}r_{u,n}^{m}}} \leq Q_{u}}{{C\; 2\text{:}{\sum_{n \in R_{cand}}a_{n}}} \leq {\min\left\{ {\frac{\lambda}{w},1} \right\}}}} & (11) \end{matrix}$

If both of these conditions are true ((C1, C2)=(True, True)), then problem (10) can optimally be solved by simply setting {circumflex over (v)}(u, n, m)=r_(u,n) ⁻², ∀n∈R_(cand) with {circumflex over (v)}(u, n, m)=0∀n∈N/R_(cand). For the remaining possibilities, non-negative scalars Θ, ζ₁, ζ₂ and the effective normalized RB costs ā_(n), ∀n are determined using problem (12):

$\begin{matrix} {{\left( {{C\; 1},{C\; 2}} \right) = \left. \left( {{True},{False}} \right)\Rightarrow{\Theta > 1} \right.},{\zeta_{1} = 0},{\zeta_{2} = 1},{a_{n} = {{{\overset{\_}{a}}_{n}\text{/}\min\left\{ {\frac{\lambda}{w},1} \right\}{\forall{n\left( {{C\; 1},{C\; 2}} \right)}}} = \left. \left( {{False},{True}} \right)\Rightarrow{\Theta > 1} \right.}},{\zeta_{1} = 1},{\zeta_{2} = 0},{{\overset{\_}{a}}_{n} = {{1{\forall{n\left( {{C\; 1},{C\; 2}} \right)}}} = \left. \left( {{False},{False}} \right)\Rightarrow{\Theta > 2} \right.}},{\zeta_{1} = 1},{\zeta_{2} = 1},{{\overset{\_}{a}}_{n} = {a_{n}\text{/}\min\left\{ {\frac{\lambda}{w},1} \right\}{\forall n}}}} & (12) \end{matrix}$ Then, an adequate feasible solution to problem (5) is determined using the greedy procedure that is outlined in Table 2.

TABLE 2 Greedy Bit Allocation  1. Set {circumflex over (v)}(u, n, m) = 0, ∀ n = 1, . . . , N and G = 0 and V̆_(n) = V_(n), ∀ n ∈ R_(cand)  2. Determine Θ, ζ₁, ζ₂ and ā_(n), ∀ n, using (12)  3. while ζ₁ + ζ₂ ≤ θ do  4.   ${{Determine}\mspace{14mu}\hat{l}} = {{argmax}_{l\;{\epsilon R}_{cand}}{\underset{b_{l}{\epsilon B}_{u}}{\mspace{11mu}\max}{\left\{ \frac{{\alpha_{u}{b_{l}\left( {1 - {p_{u,l}^{m}\left( b_{l} \right)}} \right)}} - {\overset{\Cup}{V}}_{l}}{\frac{\zeta_{1}b_{l}}{Q_{u}} + {\zeta_{2}{\overset{\_}{a}}_{l}}} \right\}\mspace{14mu}{and}\mspace{14mu}{let}\mspace{14mu}{\hat{b}}_{\hat{l}}}}}$  denote the corresponding optimal bit loading.  5.  if ζ₁θ{circumflex over (^(b))} ^({circumflex over (l)}) ^(/Q) ^(u) ≤ θ and ζ₂θ ^(a) ^({circumflex over (l)}) ≤ θ then  6.   Set {circumflex over (v)}(u, {circumflex over (l)}, m) = α_(u){circumflex over (b)}{circumflex over (_(l))}(1 − p_(u,){circumflex over (_(l))}^(m)({circumflex over (b)}{circumflex over (_(l))})) and G = G + {circumflex over (v)}(u, {circumflex over (l)}, m) − ${\overset{\Cup}{V}}_{\hat{l}}$  7.    ${{Set}\mspace{14mu}{\overset{\Cup}{V}}_{\hat{l}}} = {\hat{v}\left( {u,\hat{l},m} \right)}$  8.  end if  9.  Update ζ₁ = ζ₁θ{circumflex over (^(b))} ^({circumflex over (l)}) ^(/Q) ^(u) and ζ₂ = ζ₂θ ^(a) ^({circumflex over (l)}) 10. end while 11. Determine {circumflex over (l)} = argmax_(l∈R) _(cand) {r_(u,l) ^(−m) − V_(l)} 12. if r_(u,l) ^(−m) − V_(l) > G then 13.   Set {circumflex over (v)}(u, {circumflex over (l)}, m) = r_(u,l) ^(−m) and {circumflex over (v)}(u, {circumflex over (l)}, m) = 0, ∀ n ≠ {circumflex over (l)}. 14. end if

Regarding step 2 of Table 2, it is assumed that the locally optimal RB {circumflex over (l)}, together with the corresponding optimal bit loading {circumflex over (b)}_({circumflex over (l)}), can be efficiently determined. This is indeed true when the set B (and thus B_(u)) is finite. It is also true for the 0-1 throughput model, in which case an optimal bit loading for the inner maximization on any RB l is given by {circumflex over (b)}_({circumflex over (l)})=B_(u,l) ^(m). Furthermore, in case the optimal bit loading on any RB is not unique, the largest bit loading is selected among all such optimal loading. While the approximation guarantee that will be proved next holds true for any arbitrary tie breaking, it has been seen in simulation results that the recommended method works better.

An approximation guarantee for Table 1 is now established. Towards that end, a guarantee for Table 2 is first derived.

Table 2 is a constant-factor approximation algorithm for problem (10), where the constant factor is given by

$\eta = {\frac{1}{2}{\left( \frac{1}{\exp\left( {1\text{/}\Theta} \right)} \right).}}$

The definition of R_(cand) is recalled and a ground set of tuples, {tilde over (Ψ)}={(l,b_(l)), ∀l∈R_(cand) & b_(l)∈B_(u)}. Note that, for the same RB l, there can be several distinct tuples in {tilde over (Ψ)} corresponding to different bit loading b_(l). Then, a normalized non-negative set function, ƒ: 2^({tilde over (Ψ)})→IR₊, is defined, such that ƒ (Ø)=0 and, for all other subsets A⊂{tilde over (Ψ)}, obtained is:

${f(A)} = {\sum\limits_{l \in R_{cand}}{\underset{l^{\prime} = l}{\max\limits_{{({l^{\prime},b_{l^{\prime}}})} \in A}}\left\{ \left( {{\alpha_{u}{b_{l}\left( {1 - {p_{u,l}^{m}\left( b_{l} \right)}} \right)}} - V_{l}} \right)^{+} \right\}}}$ Where (x)⁺=max{0, x} for all real-valued scalar x. Problem (10) can now be expressed as:

$\begin{matrix} {{\max\limits_{A \subseteq \overset{\sim}{\Psi}}\left\{ {f(A)} \right\}}{{{s.t}\mspace{14mu}{\sum_{{({l,b_{l}})} \in A}b_{l}}} \leq Q_{u}}{{\sum_{{({l,b_{l}})} \in A}a_{l}} \leq {\min\left\{ {\frac{\lambda}{w},1} \right\}}}} & (13) \end{matrix}$

It can be readily verified that the set function ƒ(.) is a normalized non-decreasing submodular set function. Consequently, problem (13) is that of maximizing such a set function subject to two linear packing (knapsack) constraints. The conditions in problem (11) and the three scenarios subsequently listed in problem (12) identify which of the two knapsack constraints are vacuous. Then, in case only one of the constraints is relevant, Table 2 reduces to a greedy algorithm, which considers submodular set function maximization subject to one knapsack constraint, and yields a guarantee of 1−1/e. In the most general case, in which both constraints are relevant, Table 2 becomes a simple enhancement of a multiplicative updates based algorithm, which considers submodular set function maximization subject to multiple general knapsack constraints. Then, if the solution obtained upon termination (of the while-loop) is infeasible, it would compare an objective value attained by just the last tuple added, against that yielded by all the other selected tuples (i.e., the first to the penultimate one) together, and pick the choice yielding the larger objective value. One of the enhancements of the present principles can be readily seen to yield a solution at-least as good as this direct adaptation. Consequently, we can claim the guarantee of

${\frac{1}{2}\left( {1 - \frac{1}{\exp\left( {1\text{/}\Theta} \right)}} \right)},$ ∀Θ>2 (for the problem with two knapsack constraints). The desired result then corresponds to the latter smaller guarantee.

The approximation guarantee for Table 1 will now be established. Towards that end, a ground set containing all possible 3-tuples, Ψ={(u, m, b)}, is defined, where, for each such 3-tuple (or element) e=(u, m, b), u denotes the user, m denotes the mode, and b=[b₁, . . . , b_(N)]^(T) is an N length bit loading vector such that, for each RB l∈N, b_(l)>0⇒b_(l)∈B_(u) and Σ_(l∈N) b_(l)≤Q_(u). Furthermore, Σ_(l∈N) a_(n)1{b_(l)>0}≤1. With these qualifications, it is concluded that Ψ includes all possible elements, where each such element represents a valid assignment of mode, RBs, and bits to a user. Furthermore, a family of subsets of Ψ, denoted by I, is defined as: A ⊂Ψ: Σ_((u′,m′,b′)∈A)1{u′=u}≤1∀u&|A|≤K⇔A∈I  (14)

Any subset of 3-tuples from A in which each user appears at most once and whose cardinality does not exceed the user limit K is a member of I. Then, a normalized non-negative set function, h: 2^(Ψ)→IR₊, is defined, such that h(Ø)=0 and, for all other subsets A⊂Ψ,

${h(A)} = {\sum_{n \in N}{\max\limits_{{({u,m,b})} \in A}\;{\left\{ {\alpha_{u}{b_{n}\left( {1 - {p_{u,n}^{m}\left( b_{n} \right)}} \right)}} \right\}.}}}$

Lemma 1: The set function h(.) is a normalized non-decreasing submodular set function and (Ψ,I) is a matroid.

Problem (4) is now reformulated as:

$\begin{matrix} {{\max\limits_{A \subseteq \Psi}\left\{ {h(A)} \right\}}{{{{s.t}\mspace{14mu} A} \in \underset{\_}{I}};}{{\sum_{{({u,m,b})} \in A}{\sum_{n \in N}{a_{n}1\left\{ {b_{n} > 0} \right\}}}} \leq 1}} & (15) \end{matrix}$

From the definition of I, it follows that, by restricting A∈I, it is ensured that each user is selected at most once with one mode and that the associated bit loading is feasible, thereby meeting the per-user mode and bit loading constraints of problem (4). Then, the definition of the set function h(.) ensures that each RB is implicitly assigned to at most one user (since only the weighted throughput of at most one user is chosen via the max(.) function). Consequently, any feasible solution to problem (15) maps to a feasible solution to problem (4), yielding the same objective value and vice versa. Thus, problem (4) has been reformulated as that of maximizing a submodular objective subject to one matroid and one knapsack constraint. A most subtle and useful point is that, without loss of optimality, the linear knapsack constraint in problem (15) can be replaced with the following submodular constraint: Σ_(n∈N) a _(n)1{∃(u,m,b)∈A:b _(n)>0}≤1.  (16)

Considering problem (15), let O^(opt) denote an optimal solution and let O denote the final output yielded by Table 1. Furthermore, let O denote the intermediate solution obtained after stage one of Table 1. With some abuse of notation, let a_(O) denote the total cost of all the RBs occupied under O, i.e., a_(O)=Σ_(n∈R), a_(n), where R′ is defined in step 19 of Table 1. Recall that the intermediate solution O need not be feasible with respect to the cost constraint, i.e., a_(O) can be greater than 1.

Next, it is shown that the intermediate solution O at most incurs a constant-factor loss with respect to the optimal one.

The key challenges to surmount are that the ground set B_(u) can be uncountable and that problem (10) can only be approximately solved. For convenience, the notation 1{n∈A} is used for any RB n∈N and subset A⊂Ψ to return one, if there exists an element e=(u, m, b)∈A under which the bit loading on the n^(th) RB is strictly positive (b_(n)>0), and return zero otherwise. Next, a _(e) is defined as a _(e) =Σ_(n∈N) a_(n)1{n∈e}, ∀e∈Ψ. Furthermore, for any set A⊂Ψ and element e∈Ψ, h_(A)(e)=(A∪e)−h(A). Then, let e _(j)∈Ψ, j=1, . . . , J be the element (3-tuple) chosen by Table 1 at the j^(th) iteration of stage-1 and J is the number of iterations after which stage-1 of the algorithm terminates. Letting w_(j) denote the scalar w after the j^(th) iteration of Table 1, it is seen that w_(j)=λ^(Σ) ^(n=1) ^(N) ^(a) ^(n) ^(1{n∈{e) ¹ ^(, . . . , e) ^(j) ^(}}).

Proposition 2: The intermediate solution yielded by Table 1 satisfies:

$\begin{matrix} {{h(O)} \geq \frac{{h\left( O^{opt} \right)}\eta}{\eta + \lambda + 1}} & (17) \end{matrix}$

Proof: The elements of the ground set are expanded as the following ordered sequence of elements: V={e ₁, F₁, e ₂, F₂, . . . , e _(J), F_(J)}. Here, F_(J) ⊂Ψ, j=1, . . . , J−1 is the set of all elements which are rendered infeasible after the selection of the 3-tuple e _(j). In particular, each element e in this set F_(J) either shares the same user, as in e _(j), or violates the soft cost constraint, i.e., a _(e) w_(j)>λ (which precludes its subsequent selection by Table 1. The last set F_(J) is the set of elements that are rendered infeasible given that elements in O=∪_(j=1) ^(J) e _(j) have been selected. It includes all the remaining elements in Ψ. Notice that an element in this set can have a user distinct from the one in e _(J) and satisfy a _(e) w_(j)≤λ, only if either |O|=K or h_(O)(e)=0, ∀e∈F_(J). In other words, only when the algorithm is terminated either due to the user limit being reached or no remaining element offering a strictly positive gain.

Let {tilde over (F)}_(j)=e _(j)∪F_(j) j=1, . . . , J. Consider a traversal of the ordered sequence V (starting from e ₁) such that Table 1 selects elements e ₁, . . . e _(J) while discarding the rest. Suppose that it can be shown that, at every instance in this traversal, the cardinality of the set selected by Table 1 remains at least a certain constant fraction of that selected by the optimal one. Then, invoking the approximate local optimality of the selection made by Table 1 in each iteration, the desired result is established.

To obtain the bound in problem (17) the standard simple inequality is used (which follows from monotonicity and submodularity of h(.)): h(O ^(opt))≤h(O)+Σ _(e∈O) _(opt) _(\O) h _(O)( e )  (18)

Then, all elements e, from O^(opt), are discarded that belong to O^(opt)\O and for whom h_(O)(e)=0. Let Õ^(opt) denote the set after expurgating such elements from O^(opt) and note that h(O ^(opt))≤h(O)Σ _(e∈Õ) _(opt) _(\O) h _(O)({right arrow over (e)})  (19)

Next, Lemma 2 is invoked.

Lemma 2: The optimal solution (after expurgation), Õ^(opt), can be partitioned as Õ^(opt)=Õ_(I) ₁ ^(opt)∪ . . . ∪Õ_(I) _(J) ^(opt), where Õ _(I) _(J) ^(opt) ⊂∪_(l=j) ^(J) {tilde over (F)} _(l) |Õ _(I) _(J) ^(opt)|≤λ+1,∀j=1, . . . ,J  (20)

Let O_(j)=∪_(l=1) ^(j) e _(l), ∀j=1, . . . , J with O₀=Ø so that O=O_(J). Using Lemma 2 in problem (19), and again invoking the monotonicity and submodularity of h(.), the following inequality is obtained:

$\begin{matrix} {{h\left( O^{opt} \right)} \leq {{h(O)} + {\sum_{j = 1}^{J}{\sum_{\underset{\_}{e} \in O_{I_{j}}^{opt}}h_{O_{j - 1}{(\underset{\_}{e})}}}}}} & (21) \end{matrix}$

Then, a key observation that we can deduce from Proposition 1 is h _(O) _(j−1) ( e _(j))≥ηh _(O) _(j−1) ( e ),∀ e∈∪ _(l=j) ^(J) {tilde over (F)} _(l)  (22)

Using problems (20) and (22) in problem (21) yields that

$\begin{matrix} {{{h\left( O^{opt} \right)} \leq {{h(O)} + {\sum_{j = 1}^{J}{\sum_{\underset{\_}{e} \in O_{I_{j}}^{opt}}\frac{h_{O_{j - 1}{({\underset{\_}{e}}_{j})}}}{\eta}}}} \leq {{h(O)} + {\sum_{j = 1}^{J}\frac{\left( {\lambda + 1} \right)h_{O_{j - 1}{({\underset{\_}{e}}_{j})}}}{\eta}}}} = {{h(O)}\left( {1 + \frac{\lambda + 1}{\eta}} \right)}} & (23) \end{matrix}$ which is the desired result.

Theorem 3: Table 1 yields an

$\Omega\left( \frac{1}{\ln\;\left( {\min\left\{ {N,K} \right\}} \right)} \right)$ approximation guarantee for problem (15) (or problem (4)).

Proof: It is can extrapolated that that

$\begin{matrix} {{h\left( \hat{O} \right)} \geq \frac{\gamma\;{h(O)}}{a_{O} + 1}} & (23) \end{matrix}$ where γ∈(0, 1) is a constant. We next prove that a_(o) (which represents the sum cost after stage one) scales at most logarithmically.

Suppose problem (23) holds. Then, define a sequence S_(k), k=0, 1, . . . such that S₀=0 and S_(k)=Σ_(n=1) ^(N)a_(n)1{n∈{e ₁, . . . , e _(k)}}, ∀k=1, . . . , J so that w_(k)=λ^(S) ^(k) , ∀k=0, . . . , J. Notice that S_(k)−S_(k-1)≤a _(e) _(k) , k=1, . . . , J and that each e _(k), being feasible, must satisfy a _(e) _(k) ≤1, ∀k>1 as well as the (soft) constraint a _(e) _(k) w_(k-1)=a _(e) _(k) λ^(S) ^(k-1) ≤λ, ∀k≥1.

This implies that

${{S_{k} - S_{k - 1}} \leq \frac{\lambda}{\lambda^{S_{k - 1}}}},$ ∀k≥1. Then, upon defining S_(k)=S_(j), ∀k>J, it can be deduced that {S_(k)}_(k=1) ^(∞) represents a sequence in the family S(λ), defined in Lemma 3.

Lemma 3: Let S(λ) denote a family of non-negative and non-decreasing sequences parameterized by the scalar λ>1. Each sequence {S_(k)}_(k=1) ^(∞) in S(λ) must satisfy S₀=0 and

${{S_{k + 1} - S_{k}} \leq \frac{\lambda}{\lambda^{S_{k}}}},$ ∀k≥0. Then, given any positive scalar Δ such that Δ ln(λ)>1, there exists a finite integer {circumflex over (k)}≥1, such that S_(k)≤Δ ln(k), ∀k≥{circumflex over (k)} holds true for all sequences in the family S(λ).

It is noted that, in the sequence {S_(k)}_(k=1) ^(∞), the number of strictly positive increments S_(k)−S_(k-1), ∀k≥1 can be at most min{N, K}. Using this observation and invoking Lemma 2, together with Proposition 2, it is concluded that the theorem is true.

It remains thus to prove problem (22). To do so, first notice that h(O)=Σ_(n∈R′)V_(n). Furthermore, the knapsack problem in problem (7) can be solved by the greedy based pruning method employed in step 21 (in stage-2 of Table 1) with ½ guarantee, so that:

$\begin{matrix} {{{h\left( \hat{O} \right)} \geq \frac{\sum_{n \in A}V_{n}}{2}},{\forall{A \subseteq {{R^{\prime}\text{:}\mspace{14mu}{\sum_{n \in A}a_{n}}} \leq 1}}}} & (24) \end{matrix}$ Then, suppose that all the RBs in R′ can be divided into L bins such that the sum of the cost of the RBs in each bin is less than one. It can be inferred using problem (24) that

${h\left( \hat{O} \right)} \geq {\frac{h(O)}{2L}.}$ A simple bound on such L can be derived using the standard bin packing argument. In particular, there must be only one bin for which the sum cost is less than or equal to ½, else two such bins could be combined into one bin. As a result, L−1 bins must have their respective costs no less than ½, from which it can be deduced that L≤2a_(O)+1, where a_(O) is the total cost of all the RBs in R′. This yields the desired result in problem (23).

Embodiments described herein may be entirely hardware, entirely software or including both hardware and software elements. In a preferred embodiment, the present invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.

Embodiments may include a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. A computer-usable or computer readable medium may include any apparatus that stores, communicates, propagates, or transports the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be magnetic, optical, electronic, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. The medium may include a computer-readable storage medium such as a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk, etc.

Each computer program may be tangibly stored in a machine-readable storage media or device (e.g., program memory or magnetic disk) readable by a general or special purpose programmable computer, for configuring and controlling operation of a computer when the storage media or device is read by the computer to perform the procedures described herein. The inventive system may also be considered to be embodied in a computer-readable storage medium, configured with a computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner to perform the functions described herein.

A data processing system suitable for storing and/or executing program code may include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code to reduce the number of times code is retrieved from bulk storage during execution. Input/output or I/O devices (including but not limited to keyboards, displays, pointing devices, etc.) may be coupled to the system either directly or through intervening I/O controllers.

Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.

The foregoing is to be understood as being in every respect illustrative and exemplary, but not restrictive, and the scope of the invention disclosed herein is not to be determined from the Detailed Description, but rather from the claims as interpreted according to the full breadth permitted by the patent laws. It is to be understood that the embodiments shown and described herein are only illustrative of the principles of the present invention and that those skilled in the art may implement various modifications without departing from the scope and spirit of the invention. Those skilled in the art could implement various other feature combinations without departing from the scope and spirit of the invention. Having thus described aspects of the invention, with the details and particularity required by the patent laws, what is claimed and desired protected by Letters Patent is set forth in the appended claims. 

What is claimed is:
 1. A method for performing downlink scheduling in Long Term Evolution-Advanced networks, the method comprising assigning resource blocks and transmission modes to users such that (i) each of the users that is assigned at least one of the resource blocks is assigned only one transmission mode chosen from a finite set of transmission modes, (ii) a sum of normalized costs across all of the resource blocks that are assigned to the users is less than unity; and incorporating a resource block and transmission mode assignment for a user into downlink scheduler of a base station to cause the downlink scheduler to perform downlink scheduling in accordance with the resource block and transmission mode assignment.
 2. The method of claim 1, further comprising: defining a ground set of 3-tuples, each 3-tuple including a user from a set of users, a transmission mode from a set of transmission modes, and a bit-loading vector; defining an empty 3-tuple set; and adding, to the empty 3-tuple set to create a final set of 3-tuples, a 3-tuple from the ground set that meets the following 3-tuple selection criteria: (i) a user in the 3-tuple has not previously been selected; (ii) an incremental cost of the 3-tuple is less than a computed bound; and (iii) the 3-tuple provides at least a guaranteed fraction of a highest net gain in weighted sum rate utility among all such 3-tuples, wherein said incorporating step comprises incorporating the final set of selected 3-tuples into the downlink scheduler of the base station to cause the downlink scheduler to perform downlink scheduling in accordance with the final set of 3-tuples.
 3. The method of claim 2, wherein the adding step is repeated until none of the 3-tuples meet the 3-tuple selection criteria.
 4. The method of claim 2, further comprising inputting a scalar, λ, from which the computed bound is determined.
 5. The method of claim 2, wherein the computed bound is determined as a ratio having the scalar, λ, as a numerator and another scalar as a denominator in the ratio.
 6. The method of claim 2, further comprising determining whether the final set of 3-tuples satisfies a predetermined cost constraint.
 7. The method of claim 6, further comprising applying greedy pruning to the final set of 3-tuples, when the final set of 3-tuples does not satisfy the predetermined cost constraint.
 8. The method of claim 2, wherein the highest net gain in weighted sum rate utility is calculated using a backlogged traffic model.
 9. The method of claim 2, wherein the highest net gain in weighted sum rate utility is calculated using a finite queue model that assigns a finite queue size to each of the users.
 10. The method of claim 2, wherein said adding step comprises setting a first scalar used to enforce a queue constraint, and a second scalar used to enforce a constraint that a sum of effective normalized costs across occupied resource blocks is less than unity.
 11. The method of claim 10, wherein said adding step further comprises using the scalars as weights.
 12. The method of claim 1, further comprising determining the resource block, from a set of input resource blocks, and an associated bit-loading for the resource block, such that a ratio of a gain and a weighted cost is maximized for the resource block under a particular one of the transmission modes.
 13. A non-transitory computer usable memory containing processing instructions for performing downlink scheduling in Long Term Evolution-Advanced networks, the downlink scheduling comprising: assigning resource blocks and transmission modes to users such that (i) each of the users that is assigned at least one of the resource blocks is assigned only one transmission mode chosen from a finite set of transmission modes, (ii) a sum of normalized costs across all of the resource blocks that are assigned to the users is less than unity; and incorporating a resource block and transmission mode assignment for a user into downlink scheduler of a base station to cause the downlink scheduler to perform downlink scheduling in accordance with the resource block and transmission mode assignment.
 14. The non-transitory computer usable memory of claim 13, further comprising: defining a ground set of 3-tuples, each 3-tuple including a user from a set of users, a transmission mode from a set of transmission modes, and a bit-loading vector; defining an empty 3-tuple set; and adding, to the empty 3-tuple set to create a final set of 3-tuples, a 3-tuple from the ground set that meets the following 3-tuple selection criteria: (i) a user in the 3-tuple has not previously been selected; (ii) an incremental cost of the 3-tuple is less than a computed bound; and (iii) the 3-tuple provides at least a guaranteed fraction of a highest net gain in weighted sum rate utility among all such 3-tuples, wherein said incorporating step comprises incorporating the final set of selected 3-tuples into the downlink scheduler of the base station to cause the downlink scheduler to perform downlink scheduling in accordance with the final set of 3-tuples.
 15. The non-transitory computer usable memory of claim 14, wherein the adding step is repeated until none of the 3-tuples meet the 3-tuple selection criteria.
 16. The non-transitory computer usable memory of claim 14, wherein the method further comprises inputting a scalar, λ, from which the computed bound is determined.
 17. The non-transitory computer usable memory of claim 14, wherein the computed bound is determined as a ratio having the scalar, λ, as a numerator and another scalar as a denominator in the ratio.
 18. The non-transitory computer usable memory of claim 14, wherein the method further comprises determining whether the final set of 3-tuples satisfies a predetermined cost constraint.
 19. The non-transitory computer usable memory of claim 18, wherein the method further comprises applying greedy pruning to the final set of 3-tuples, when the final set of 3-tuples does not satisfy the predetermined cost constraint.
 20. The non-transitory computer usable memory of claim 14, wherein the method further comprises determining the resource block, from a set of input resource blocks, and an associated bit-loading vector for the resource block, such that a ratio of a gain and a weighted cost is maximized for the resource block under a particular one of the transmission modes. 